Asymptotic Optimality of Balanced Routing
نویسندگان
چکیده
Consider a system with K parallel single-servers, each with its own waiting room. Upon arrival, a job is to be routed to the queue of one of the servers. Finding routing policy that minimizes the total workload in the system is a known difficult problem in general. Even if the optimal policy is identified, the policy would require the full queue length information at the arrival of each job; for example, the join-the-shortest-queue policy (which is known to be optimal for identical servers with exponentially distributed service times) would require to compare the queue lengths of all the servers. In this paper, we consider a balanced routing control policy that exams only a subset of c servers, with 1 ≤ c ≤ K: specifically, upon the arrival of a job, choose a subset of c servers with a probability proportional to their service rates and then route the job to the one with the shortest queue among the c chosen servers. Under such a balanced policy, we derive the diffusion limits of the queue length processes and the workload processes. We note that the diffusion limits are the same for these processes regardless the choice of c as long as c ≥ 2. We further show that the proposed balanced routing policy for any fixed c ≥ 2 is asymptotically optimal in the sense that it minimizes the workload over all time in the diffusion limit. In addition, the policy helps to distribute works among all the servers evenly.
منابع مشابه
Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality (Online Appendix)
متن کامل
Method of Balanced Shared Explicit Reservation for Multicast Routing in Network
A given work proposes a method of balanced shared explicit reservation for multicast routing in communication network. A mathematical model for multicast routing supporting shared explicit reservation of link resource was presented, which is introduced by linear expressions that are responsible for ensuring the connectivity of the calculated multicast routes, as well as the absence of loops in ...
متن کاملThe Asymptotic Optimality of Spider-Web Networks
Pippenger, N., The asymptotic optimality of spider-web networks, Discrete Appiied Mathematics 37138 (1992) 437-450. We determine the limiting behavior of the linking probability for large spider-web networks. The result confirms a conjecture made by Ikeno in 1959. We also show that no balanced crossbar network, in which the same components are interconnected according to a different pattern, ca...
متن کاملHeavy Traffic Analysis of Open Processing Networks with Complete Resource Pooling: Asymptotic Optimality of Discrete Review Policies
We consider a class of open stochastic processing networks, with feedback routing and overlapping server capabilities, in heavy traffic. The networks we consider satisfy the so-called complete resource pooling condition and therefore have one-dimensional approximating Brownian control problems. We propose a simple discrete review policy for controlling such networks. Assuming 2 + ε moments on t...
متن کاملThe Asymptotic Optimality of the SPT Rule for the Flow Shop Mean Completion Time Problem
In the flow shop mean completion time problem, a set of jobs has to be processed on m-machines. Every machine has to process each one of the jobs, and every job has the same routing through the machines. The objective is to determine a sequence of the jobs on the machines so as to minimize the sum of the completion times of all jobs on the final machine. In this paper, we prove the asymptotic o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Operations Research
دوره 60 شماره
صفحات -
تاریخ انتشار 2012